A Method for Solving Special Circulant Pentadiagonal Linear Systems
نویسندگان
چکیده
A new effective modification of the method which is described in [1] for solving of real symmetric circulant pentadiagonal systems of linear equations is proposed. We consider the case where the coefficient matrix is not diagonal dominant. This paper shows efficiency and stability of the presented method.
منابع مشابه
A Method for Solving Hermitian Pentadiagonal Block Circulant Systems of Linear Equations
A new effective method and its two modifications for solving Hermitian pentadiagonal block circulant systems of linear equations are proposed. New algorithms based on the proposed method are constructed. Our algorithms are then compared with some classical techniques as far as implementation time is concerned, number of operations and storage. Numerical experiments corroborating the effectivene...
متن کاملRotated Alternative LU Decomposition Method and Its Preconditioner for Periodic Block Pentadiagonal Linear Systems on Vector Processor
In this paper, a new method "Rotated Alternative LU (Rotated ALU) decomposition" for solving block pentadiagonal linear systems is proposed, that makes vector processing more e cient. And a new way to apply the Rotated ALU decomposition to periodic pentadiagonal linear systems is proposed. A few numerical experiments show that these methods are more faster than the conventional LU decomposition.
متن کاملA parallel method for solving pentadiagonal systems of linear equations
A new parallel approach for solving a pentadiagonal linear system is presented. The parallel partition method for this system and the TW parallel partition method on a chain of P processors are introduced and discussed. The result of this algorithm is a reduced pentadiagonal linear system of order P 2 compared with a system of order 2P 2 for the parallel partition method. More importantly the n...
متن کاملFast Algorithms for Solving RFPrLR Circulant Linear Systems
In this paper, fast algorithms for solving RFPrLR circulant linear systems are presented by the fast algorithm for computing polynomials. The unique solution is obtained when the RFPrLR circulant matrix over the complex field C is nonsingular, and the special solution and general solution are obtained when the RFPrLR circulant matrix over the complex field C is singular. The extended algorithms...
متن کاملOn Solving Pentadiagonal Linear Systems via Transformations
Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article is describes new numeric and symbolic algorithms for solving pentadiagonal linear systems via transformations. New algorithms are natural generalization of the work presented in [Moawwad ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999